129 research outputs found
Acyclic Coloring of Graphs of Maximum Degree
International audienceAn acyclic coloring of a graph is a coloring of its vertices such that: (i) no two neighbors in are assigned the same color and (ii) no bicolored cycle can exist in . The acyclic chromatic number of is the least number of colors necessary to acyclically color , and is denoted by . We show that any graph of maximum degree has acyclic chromatic number at most for any , and we give an algorithm to acyclically color any graph of maximum degree with the above mentioned number of colors. This result is roughly two times better than the best general upper bound known so far, yielding . By a deeper study of the case , we also show that any graph of maximum degree can be acyclically colored with at most colors, and give a linear time algorithm to achieve this bound
Minimum feedback vertex set and acyclic coloring
International audienceIn the feedback vertex set problem, the aim is to minimize, in a connected graph G =(V,E), the cardinality of the set overline(V) (G) \subseteq V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring problem (which consists in coloring vertices of a graph G such that no two colors induce a cycle in G). Then, using results from acyclic coloring, as well as other techniques, we are able to derive new lower and upper bounds on the cardinality of a minimum feedback vertex set in large families of graphs, such as graphs of maximum degree 3, of maximum degree 4, planar graphs, outerplanar graphs, 1-planar graphs, k-trees, etc. Some of these bounds are tight (outerplanar graphs, k-trees), all the others differ by a multiplicative constant never exceeding 2
Minimum feedback vertex set and acyclic coloring
International audienceIn the feedback vertex set problem, the aim is to minimize, in a connected graph G =(V,E), the cardinality of the set overline(V) (G) \subseteq V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring problem (which consists in coloring vertices of a graph G such that no two colors induce a cycle in G). Then, using results from acyclic coloring, as well as other techniques, we are able to derive new lower and upper bounds on the cardinality of a minimum feedback vertex set in large families of graphs, such as graphs of maximum degree 3, of maximum degree 4, planar graphs, outerplanar graphs, 1-planar graphs, k-trees, etc. Some of these bounds are tight (outerplanar graphs, k-trees), all the others differ by a multiplicative constant never exceeding 2
On the oriented chromatic number of grids
International audienceIn this paper, we focus on the oriented coloring of graphs. Oriented coloring is a coloring of the vertices of an oriented graph without symmetric arcs such that (i) no two neighbors in are assigned the same color, and (ii) if two vertices and such that are assigned colors and , then for any , we cannot have simultaneously and . The oriented chromatic number of an unoriented graph is the smallest number of colors for which any of the orientations of can be colored with colors. The main results we obtain in this paper are bounds on the oriented chromatic number of particular families of planar graphs, namely 2-dimensional grids, fat trees and fat fat trees
âLe patrimoine, câest un truc pour les vieuxâŠâ
En dĂ©pit des possibilitĂ©s offertes par le dĂ©veloppement culturel et la mise en valeur du patrimoine dans le secteur du tourisme, les politiques publiques de ce type peuvent Ă©galement faire lâobjet de critiques et de contestation sociale. Dans la commune dâAbondance, petite station de ski de Haute-Savoie, la municipalitĂ© a tentĂ© en 2007 de fermer dĂ©finitivement les remontĂ©es mĂ©caniques pour dĂ©velopper un tourisme autour du patrimoine gothique de la cour de Savoie. De fortes contestations sont notamment apparues autour des points suivants : 1) le manque de viabilitĂ© Ă©conomique (ainsi que le rĂ©sume lâun des responsables, âles gens nây croient pasâ) ; 2) Ă lâinverse du ski en station, le tourisme patrimonial est associĂ© Ă lâimaginaire nĂ©gatif de la vieillesse, de lâimmobilitĂ©, voire de la mort ; 3) pour les rĂ©sidents de la commune, la mise en place dâun site de visite localisĂ© comporte les inconvĂ©nients dâune frĂ©quentation de type turnover.Despite the opportunities offered by cultural heritage in the tourism sector, this article, based on a case study of a little town in the French Alps, shows that public policy of this type may also be subject to criticism and contestation. In Abondance, the municipality is making efforts to convert their ski resort into a cultural tourism site which is built around the heritage of the Gothic Court of Savoy. However: 1) As summarised by one of the local leaders âthe people do not believe in itâ and fear that is not economically viable. 2) In contrast to the ski resort, heritage tourism is only attached to the imagination of old age, immobility and even death. 3) For residents of the town, setting up a localised visit site has disadvantages because of the turnover of touristic traffic to which this type of tourism is exposed
On star edge colorings of bipartite and subcubic graphs
A star edge coloring of a graph is a proper edge coloring with no -colored
path or cycle of length four. The star chromatic index of
is the minimum number for which has a star edge coloring with
colors. We prove upper bounds for the star chromatic index of complete
bipartite graphs; in particular we obtain tight upper bounds for the case when
one part has size at most . We also consider bipartite graphs where all
vertices in one part have maximum degree and all vertices in the other part
has maximum degree . Let be an integer (), we prove that if
then ; and if , then ; both upper bounds are sharp.
Finally, we consider the well-known conjecture that subcubic graphs have star
chromatic index at most ; in particular we settle this conjecture for cubic
Halin graphs.Comment: 18 page
- âŠ